New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
نویسندگان
چکیده
منابع مشابه
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a family of heuristics is based on the use of new scores updating criteria developed in order to overcome some of the typical unpleasant behaviors of DPLL search techniques. In particular, a score is associated with each lit...
متن کاملThe Impact of Branching Heuristics in Propositional Satisfiability Algorithms
This paper studies the practical impact of the branching heuristics used in Propositional Satisfiability (SAT) algorithms, when applied to solving real-world instances of SAT. In addition, different SAT algorithms are experimentally evaluated. The main conclusion of this study is that even though branching heuristics are crucial for solving SAT, other aspects of the organization of SAT algorith...
متن کاملConflict Analysis in Search Algorithms for Satisfiability
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Prop-ositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques, some of which are specific to SAT, whereas others find equivalent in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during search and its most dis...
متن کاملAdding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers
The paper is concerned with the computational evaluation of a new branching heuristic, called reverse assignment sequence (RAS), for evolved DPLL Satisfiability solvers. Such heuristic, like several other recent ones, is based on the history of the conflicts obtained during the solution of an instance. A score is associated to each literal. When a conflict occurs, some scores are incremented wi...
متن کاملLearning to Select Branching Rules in the DPLL Procedure for Satisfiability
The DPLL procedure is the most popular complete satisfiability (SAT) solver. While its worst case complexity is exponential, the actual running time is greatly affected by the ordering of branch variables during the search. Several branching rules have been proposed, but none is the best in all cases. This work investigates the use of automated methods for choosing the most appropriate branchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2008
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.10.012